Detecting logical relationships based on structured query statements

ABSTRACT

An example computer-implemented method includes receiving, via a processor, a plurality of structured query statements associated with an application and a database. The method includes detecting, via the processor, a logical relationship between at least two of the plurality of structured query statements based on a common source, a predetermined threshold time, a common transaction. The method includes generating, via the processor, a model based on the detected logical relationship. The method further includes receiving, via the processor, a request to modify the database. The method also further includes modifying, via the processor, the database in response to detecting that a predetermined threshold probability of application functionality impairment is not exceeded.

BACKGROUND

The present techniques relate to detecting logical relationships indatabases. More specifically, the techniques relate to detecting logicalrelationships in databases based on structured query statements.

SUMMARY

According to an embodiment described herein, a system can includeprocessor to receive a plurality of structured query statementsassociated with an application and a database. The processor can alsofurther detect a logical relationship between at least two of theplurality of structured query statements based on a common source, apredetermined threshold time, a common transaction. The processor canalso generate a model based on the detected logical relationship. Theprocessor can further receive a request to modify the database. Theprocessor can also further modify the database in response to detectingthat a predetermined threshold probability of application functionalityimpairment is not exceeded.

According to another embodiment described herein, a computer-implementedmethod can include receiving, via a processor, a plurality of structuredquery statements associated with an application and a database. Themethod can further include detecting, via the processor, a logicalrelationship between at least two of the plurality of structured querystatements based on a common source, a predetermined threshold time, acommon transaction. The method can also further include generating, viathe processor, a model based on the detected logical relationship. Themethod can also include receiving, via the processor, a request tomodify the database. The method can also further include modifying, viathe processor, the database in response to detecting that apredetermined threshold probability of application functionalityimpairment is not exceeded.

According to another embodiment described herein, a computer programproduct for detecting logical relationships between structured querystatements. The computer readable storage medium is not a transitorysignal per se. The program code executable by a processor to cause theprocessor to receive a plurality of structured query statementsassociated with an application and a database. The program code can alsocause the processor to detect a logical relationship between at leasttwo of the plurality of structured query statements based on a commonsource of the at least two structured query statements, a predeterminedthreshold time between the at least two structured query statements, acommon transaction associated with the at least two structured querystatements. The program code can also cause the processor to generate amodel based on the detected logical relationship. The program code canalso cause the processor to receive a request to modify the database.The program code can also cause the processor to modify the database inresponse to detecting that a predetermined threshold probability ofapplication functionality impairment is not exceeded.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 is an example system for detecting logical relationships based onstructured query statements;

FIG. 2 is a process flow diagram of an example method for detectinglogical relationships based on structured query statements;

FIG. 3 is a block diagram of an example cloud computing environmentaccording to embodiments described herein;

FIG. 4 is an example abstraction model layers according to embodimentsdescribed herein;

FIG. 5 is a block diagram of an example computing device that can detectlogical relationships based on structured query statements; and

FIG. 6 is an example tangible, non-transitory computer-readable mediumthat can detect logical relationships based on structured querystatements.

DETAILED DESCRIPTION

Sometimes schema information for databases cannot be known in advancewhen developing software products that are to operate on a customer'sdatabases. Although relational database management systems may supportdeclarative referential integrity through the definition of primarykeys, foreign keys and indexes, many databases are designed without suchconstraints. For example, a database may not be designed with theseconstraints for performance and flexibility reasons. This can prevent aproduct from querying database metadata and obtaining the relationshipsfrom the database metadata.

When one or more applications access a relational database, thecorresponding queries, updates and deletions may contain predicates andjoin operations, among others. In some examples, the predicates and joinoperations may imply logical relationships between the various tables ofthe database. As used herein, logical relationships refer to impliedrelationships that are effectively built into the application(s) thataccess a database. By contrast, as used herein, physical relationshipsrefer to relationships described by the referential integrity designedinto a database through the use of foreign keys.

According to embodiments of the present disclosure, a computing systemcan detect logical relationships based on structured query statementsand generate data flow graphs based on the logical relationships. Forexample, the system can receive a plurality of structured querystatements associated with an application and a database. For example,the structured query statements can be Structured Query Language (SQL)statements. The system can detect logical relationships among theplurality of structured query statements based on a source, a time,and/or transaction. For example, the source can be indicated by an IPaddress and the time can be indicated by a time stamp. The system canthen generate a data flow graph based on the detected logicalrelationship. In some examples, the system can generate a report basedon the detected logical relationships. For example, the report caninclude a trust level or trust score. Thus, the present techniquesenable computer products to be developed that do not violate the impliedconstraints of the logical relationships. For example, products caninclude extract, transform and load (ETL) products; data masking andredaction products; and archiving products; among other products thatuse knowledge of inter-table relationships and columns to be used forsorting results and deleting data without the need for the customer toenter this information manually. Furthermore, the present techniquesenable a database administrator to see the implications of changing adatabase structure. For example, a database administrator may want tochange a database structure and thus may want to know the implicationsof changing the structure, such as what applications might be affectedby that change by assuming logical relations between fields that mightnot be correct after the change. The present techniques can displaydetected logical relationships so that the DB administrator can take thelogical relationships into account when making any changes in databasestructure. Furthermore, the present techniques enable applications thatgenerate reports to include a trust level so that a data analyzer canestimate how much to trust the reports based on where the data was takenfrom and based on what relations in the database the report is assuming.

In some scenarios, the techniques described herein may be implemented ina cloud computing environment. As discussed in more detail below inreference to at least FIGS. 3-5, a computing device configured to detectlogical relationships based on structured query statements may beimplemented in a cloud computing environment. It is understood inadvance that although this disclosure may include a description on cloudcomputing, implementation of the teachings recited herein are notlimited to a cloud computing environment. Rather, embodiments of thepresent invention are capable of being implemented in conjunction withany other type of computing environment now known or later developed.

Cloud computing is a model of service delivery for enabling convenient,on-demand network access to a shared pool of configurable computingresources (e.g. networks, network bandwidth, servers, processing,memory, storage, applications, virtual machines, and services) that canbe rapidly provisioned and released with minimal management effort orinteraction with a provider of the service. This cloud model may includeat least five characteristics, at least three service models, and atleast four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provisioncomputing capabilities, such as server time and network storage, asneeded automatically without requiring human interaction with theservice's provider.

Broad network access: capabilities are available over a network andaccessed through standard mechanisms that promote use by heterogeneousthin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to servemultiple consumers using a multi-tenant model, with different physicaland virtual resources dynamically assigned and reassigned according todemand. There is a sense of location independence in that the consumergenerally has no control or knowledge over the exact location of theprovided resources but may be able to specify location at a higher levelof abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elasticallyprovisioned, in some cases automatically, to quickly scale out andrapidly released to quickly scale in. To the consumer, the capabilitiesavailable for provisioning often appear to be unlimited and can bepurchased in any quantity at any time.

Measured service: cloud systems automatically control and optimizeresource use by leveraging a metering capability at some level ofabstraction appropriate to the type of service (e.g., storage,processing, bandwidth, and active user accounts). Resource usage can bemonitored, controlled, and reported providing transparency for both theprovider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer isto use the provider's applications running on a cloud infrastructure.The applications are accessible from various client devices through athin client interface such as a web browser (e.g., web-based email). Theconsumer does not manage or control the underlying cloud infrastructureincluding network, servers, operating systems, storage, or evenindividual application capabilities, with the possible exception oflimited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer isto deploy onto the cloud infrastructure consumer-created or acquiredapplications created using programming languages and tools supported bythe provider. The consumer does not manage or control the underlyingcloud infrastructure including networks, servers, operating systems, orstorage, but has control over the deployed applications and possiblyapplication hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to theconsumer is to provision processing, storage, networks, and otherfundamental computing resources where the consumer is able to deploy andrun arbitrary software, which can include operating systems andapplications. The consumer does not manage or control the underlyingcloud infrastructure but has control over operating systems, storage,deployed applications, and possibly limited control of select networkingcomponents (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for anorganization. It may be managed by the organization or a third party andmay exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by severalorganizations and supports a specific community that has shared concerns(e.g., mission, security requirements, policy, and complianceconsiderations). It may be managed by the organizations or a third partyand may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the generalpublic or a large industry group and is owned by an organization sellingcloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or moreclouds (private, community, or public) that remain unique entities butare bound together by standardized or proprietary technology thatenables data and application portability (e.g., cloud bursting forload-balancing between clouds).

A cloud computing environment is service oriented with a focus onstatelessness, low coupling, modularity, and semantic interoperability.At the heart of cloud computing is an infrastructure comprising anetwork of interconnected nodes.

With reference now to FIG. 1, an example system is shown that can detectlogical relationships based on structured query statements. The examplesystem is generally referred to by the reference number 100 and can beimplemented using the example computing device 500 of FIG. 5 below.

The example system 100 of FIG. 1 includes one or more client devices102, a network proxy 104, a database server 106, and a computing device108. The at least one client device 102 includes an application 110 thatis communicatively coupled in two directions to the network proxy 104 asindicated via arrows 112 and 114. The network proxy 104 includes acapture module 116 and is communicatively coupled to a database 118 of adatabase server 106 as indicated by arrows 120 and 122. The networkproxy 104 is further communicatively coupled to the computing device 108as indicated by an arrow 124. The computing device 108 includes arelationship detector 126 and a repository 128.

As shown in FIG. 1, the application 110 of the at least one clientdevice 102 may send structured query statements to the database 118 ofthe database server 106 via the network proxy 104. For example, theapplication 110 may issue SQL statements against the database 118. Insome examples, the application 110 can access the database 118 through aTCP/IP (or similar) network interface, resulting in a tiered ITarchitecture with the database server 106 running on one tier and theapplication 110 accessing the database 118 on a different tier. In someexamples, the capture module 116 of the network proxy 104 can capturestructured query statements using a proxy process. For example, thecapture module 116 can be part of a software appliance. The softwareappliance may utilize the network proxy 104 that sits between theapplication 110 and the database server and effectively copy the networkpackets being sent back and forth as indicated by arrows 112, 114, 120,and 122. In some examples, the capture module 116 can send the capturedstructured query statements to the computing device 108. In someexamples, the captured structured query statements may be stored in therepository 128 for subsequent use and/or analysis. In some examples,structured query statements can be obtained by the computing device 108by extracting SQL statements from the source code of the application 110that accesses the database 118. For example, if the source code isavailable, then the source code can be received by the relationshipdetector 126 for analysis. In some examples, the structured querystatements can be alternatively obtained by extracting the SQLstatements from pre-bound packages stored within the database 118. Forexample, the pre-bound package may be stored within a metadatarepository of the database 118. Packages, as used herein, refer tocontrol-structure database objects that contain executable forms ofstructured query statements or placement holders for executable forms.Pre-bound packages, as used herein, refer to structured query statementsbefore the query statements are processed in order to execute them on adatabase server product. In some examples, the structured querystatements may be obtained by capturing SQL statements from a bespokedatabase driver. As used herein, a bespoke database driver is a modulethat acts like a “wrapper” around the real driver. For example, thebespoke database driver can be an application programming interface(API) for accessing databases such as Open Database Connectivity (ODBC),Java Database Connectivity (JDBC), or a proprietary driver on thecomputing device 102 including the application 110.

The relationship detector 126 can analyze the captured structured querystatements and detect one or more logical relationships. In someexamples, the logical relationships can be detected in real time. Forexample, the capture module 116 can send captured structured querystatements directly to the relationship detector 126 for real timeanalysis. In some examples, the logical relationships can be detectedafter a predetermined amount of time. For example, after thepredetermined amount of elapsed time, a plurality of structured querystatements issued by one or more applications 110 against the database118 may have been captured by the capture module 116 and stored in therepository 128. The relationship detector 126 can analyze the pluralityof structured query statements to detect one or more logicalrelationships.

The relationship detector 126 can also generate a model based on thedetected logical relationships. For example, the relationship detector126 can create a logical data model based on the detected logicalrelationships. In some examples, the model can include a data flowgraph.

For example, database designers typically try to normalize datastructures to a point where the amount of duplicated information isreduced as much as possible or practical. Such database design mayresult in a database 118 containing a large number of tables, many ofwhich are maintained with parent/child relationships. For example, thetables may correspond to customers, orders, and order items. A customermay have placed many orders and each of those orders may contain manyorder items. To query the orders for an on-line customer, a structuredquery statement such as a SQL SELECT statement may contain a join suchsimilar to the statement:

SELECT * FROM CUSTOMER C, ORDER O  WHERE C.CUST_NO = ? AND C.CUST_NO = O.CUST_NO

-   -   The ‘?’ can be a placeholder for an actual customer number and        can be supplied by the application 110 as a variable data value        accompanying the SQL statement. By analyzing SQL statements like        the above statement, a relationship detector 126 can infer that        the ORDER table is a child of the CUSTOMER table and that the        logical foreign key is CUST_NO. Similarly, to find all order        items for an order, the application 110 may issue an SQL        statement similar to:

SELECT * FROM ORDER O, ITEM I  WHERE O.ORDER_NO = ? AND O.ORDER_NO =  I.ORDER_NO

-   -   This SQL statement can allow the relationship detector 126 to        infer that the ITEM table is a child of the ORDER table and that        the logical foreign key is ORDER_NO.

In a second, more complex example, an application 110 may query allorders and items for a customer using an SQL statement similar to:

SELECT * FROM CUSTOMER C, ORDER O, ITEM I  WHERE C.CUST_NO = ? ANDO.CUST_NO =   C.CUST_NO  AND O.ORDER_NO = I.ORDER_NO

-   -   While slightly more complex, analysis of such a statement can        lead to the same result as the analysis of the individual        statements. For example, the relationship detector 126 may infer        that the ORDER table is a child of the CUSTOMER table, the        logical foreign key is CUST_NO, the ITEM table is a child of the        ORDER table, and the logical foreign key is ORDER_NO.

In some examples, for products within the ETL and archiving space, therelationship detector 126 can also determine which columns are used forsorting in order to automatically suggest to a customer that thosecolumns become indexes in the target data source. For example, anapplication 110 listing a customer's orders may use an SQL statementsimilar to:

SELECT * FROM ORDER  WHERE CUST_NO = ?  ORDER BY ORDER_DATE

From statements like the above, the relationship detector 126 can inferthat using ORDER_DATE on the ORDER table as an index can improveperformance. For example, such an index can improve performance in anarchive or a data warehouse.

In another example, in order to ensure accurate updates and deletionsfrom a database, tables in database 118 can include an identifier thatserves as a primary key. For example, a primary key can be a uniquenational id like a social security number, or an opaque id like anumber, or a universally unique identifier (UUID). The primary keyensures that when a record is updated for a customer with a common namethe correct person, and only the correct person, is updated or deleted.For example, the common name may be John Smith and there may be multipleJohn Smiths in the database 118. To delete a customer, an application110 may issue an SQL statement similar to:

DELETE FROM CUSTOMER  WHERE CUST_ID = ?

-   -   In another example, to update a preferred credit card number for        a customer, an application may issue an SQL statement similar        to:

UPDATE CUSTOMER  SET CCN = ?  WHERE CUST_ID = ?

-   -   By analyzing statements like the above, a relationship detector        126 can infer that CUST_ID is a primary key on the CUSTOMER        table.

In another example, the SQL statements may be even more complicated. Forexample, the SQL statements may contain several table join operationsand predicates that span multiple columns. Regardless of the addedcomplexity, the relationship detector 126 can analyze the SQL statementsand detect logical relationships. For example, the logical relationshipscan include logical primary keys, foreign keys, and indexes. In someexamples, if all captured SQL statements are stored in the repository128, the relationship detector 126 can analyze patterns in batches ofSQL statements. A batch, as used herein, refers to a plurality ofstructured query statements that come from the same IP address, within apredetermined time, and against the same tables. This analysis may helpin identifying implicit business objects from an observation of commonquery batches against a series of tables. For example, if therelationship detector 126 repeatedly detects the same three SQLstatements against CUSTOMER, ADDRESS, and CREDIT_SCORES from the sameapplication 110 from the same IP addresses within milliseconds of eachother, then the relationship detector 126 can treat the SQL statementsas a batch.

In some examples, if the returned data for each request indicated byarrow 122 is also saved to the repository 128, the relationship detector126 can analyze that information to detect relations between tables byanalyzing batches of SQL statements. For example, if the relationshipdetector 126 detects that a query “Select ID from CUSTOMER” returns avalue “Ahdgdt2gd5” and soon after the relationship detector 126 detectsa query “select * from ORDER where the CID=Ahdgdt2gd5”, then therelationship detector 126 can detect a logical relationship betweenCUSTOMER and ORDER and that CID is a foreign key.

In some examples, the capture module 116 can capture transactions thatapplications 110 are performing for updating information via networktraffic sniffing. By analyzing the SQL statements within thosetransactions, relationship detector 126 can detect transactional logicalrelationships between those tables. In some examples, the relationshipdetector 126 can detect a transactional logical relationship betweentables even if there is no explicit transaction in the database. Forexample, the relationship detector 126 can detect a transactionallogical relationship based on a repeated pattern of updates or deletionsin close time periods from the same application 110 corresponding to aclient device 102 with the same IP address. For example, the same IPaddress may indicate that the application is operating at the samecomputing device 102.

In some examples, once the relationship detector 126 has analyzed asufficiently large number of SQL statements the relationship detector126 can generate a logical data model that contains the logicalrelationships, keys, and indexes utilized by the application(s) thataccess the database 118. Such logical data models can be expressed in anumber of ways. For example, a logical data model can be expressed as adatabase definition language (DDL) model, an InfoSphere® Data Architectlogical data model, an ERwin® data model, an Extensible Markup Language(XML) model, a JavaScript Object Notation (JSON) model, among othersuitable data formats. In some examples, where the logical data model isexpressed in a common and/or standard format, other products may utilizethe information therein. For example, the logical data model can beshared with other computing devices.

FIG. 2 is a process flow diagram of an example method for detectinglogical relationships based on structured query statements. The method200 can be implemented using any suitable computing device, such as theprocessor 502 of the computing device 500 of FIG. 5 below.

At block 202, a processor receives a plurality of structured querystatements associated with an application and a database. For example,the structure query statements can be captured via a network proxybetween an application and a database server. In some examples, theprocessor can also receive a plurality of responses to the structuredquery statements. For example, the plurality of responses may also havebeen captured via the network proxy. In some examples, the processor canreceive a source code of the application and extract the structuredquery statements from the source code of the application. In someexamples, the processor can extract the structured query statements frompre-bound packages stored within a database metadata repository. In someexamples, the structured query statements may have been captured via abespoke database driver.

At block 204, the processor detects logical relationships among aplurality of structured query statements based on a common source, apredetermined threshold time, and/or a same transaction. For example, acommon source can be detected via a same IP address. The predeterminedthreshold time can be a maximum time period in which two or morestructured query statements were captured. The same transaction can be acommon series of structure query statements and responses. In someexamples, the detected logical relationship can be further based on atleast one of the plurality of responses to the structured querystatements.

At block 206, the processor generates a model based on the detectedlogical relationships. For example, the model can include a data flowgraph. In some examples, the model can be expressed as a databasedefinition language (DDL) model, an InfoSphere® Data Architect logicaldata model, an ERWin® data model, an XML model, a JSON model, or anyother suitable data format.

At block 208, the processor receives a request to modify the database.For example, the modification request can include a request to modify astructure of the database.

At block 210, the processor modifies the database in response todetecting that a predetermined threshold probability of applicationfunctionality impairment is not exceeded. For example, the processor canmodify the schema of the database, or remove and/or split tables in thedatabase. The predetermined threshold probability of functionalityimpairment can be a predetermined threshold probability that anapplication will execute with an error if a modification in the databasestructure is performed related to a detected logical relationship. Forexample, the request to modify the database may modify the logicalrelationship. The processor can assess the probability that theapplication assumes such logical relationship based on the method thatthe logical relationship was detected. For example, the processor cancalculate a high probability of impairment for a logical relationshipbased on a single structured query, while calculating a low probabilityfor a rare combination in the same time frame for two entities. Forexample, the two entities may have a low probability of assuming logicalrelationships and therefore have a low probability of impairment. Insome examples, the processor can generate a report based on the model.For example, the report can include a trust level. The trust level canbe based on the detected logical relationships of the database and therelationships assumed by the application generating the report andindicates the strength of the detected logical relationships and anassociated probability that any modification to database structuresassociated with the detected logical relationships may result inimpairment of application functionality. In some examples, the trustlevel can be indicated by color and thus provide a visual indication ofthe strength of the detected logical relationships. In some examples,the processor can also display a warning in response to receiving astructural change to a database that modifies the detected logicalrelationship. The warning can indicate that a structural change to thedatabase may cause one or more functionalities of the application tostop working properly. In some examples, the processor can receive amodification confirmation in response to the report and modify thedatabase. In some examples, the processor can detect that one or morefunctionalities may be affected with a probability exceeding thepredetermined threshold probability based on detected logicalrelationships. The processor can reject the modification request toprevent the functionalities from being impaired. Thus, the presenttechniques prevent application functionality from being impaired bydatabase modifications.

The process flow diagram of FIG. 2 is not intended to indicate that theoperations of the method 200 are to be executed in any particular order,or that all of the operations of the method 200 are to be included inevery case. Additionally, the method 200 can include any suitable numberof additional operations.

Referring now to FIG. 3, an illustrative cloud computing environment 300is depicted. As shown, cloud computing environment 300 comprises one ormore cloud computing nodes 302 with which local computing devices usedby cloud consumers, such as, for example, personal digital assistant(PDA) or cellular telephone 304A, desktop computer 304B, laptop computer304C, and/or automobile computer system 304N may communicate. Nodes 302may communicate with one another. They may be grouped (not shown)physically or virtually, in one or more networks, such as Private,Community, Public, or Hybrid clouds as described hereinabove, or acombination thereof. This allows cloud computing environment 300 tooffer infrastructure, platforms and/or software as services for which acloud consumer does not need to maintain resources on a local computingdevice. It is understood that the types of computing devices 304A-Nshown in FIG. 3 are intended to be illustrative only and that computingnodes 302 and cloud computing environment 300 can communicate with anytype of computerized device over any type of network and/or networkaddressable connection (e.g., using a web browser).

Referring now to FIG. 4, a set of functional abstraction layers providedby cloud computing environment 300 (FIG. 3) is shown. It should beunderstood in advance that the components, layers, and functions shownin FIG. 4 are intended to be illustrative only and embodiments of theinvention are not limited thereto. As depicted, the following layers andcorresponding functions are provided.

Hardware and software layer 400 includes hardware and softwarecomponents. Examples of hardware components include mainframes, in oneexample IBM® zSeries® systems; RISC (Reduced Instruction Set Computer)architecture based servers, in one example IBM pSeries® systems; IBMxSeries® systems; IBM BladeCenter® systems; storage devices; networksand networking components. Examples of software components includenetwork application server software, in one example IBM WebSphere®application server software; and database software, in one example IBMDB2® database software. (IBM, zSeries, pSeries, xSeries, BladeCenter,WebSphere, and DB2 are trademarks of International Business MachinesCorporation registered in many jurisdictions worldwide).

Virtualization layer 402 provides an abstraction layer from which thefollowing examples of virtual entities may be provided: virtual servers;virtual storage; virtual networks, including virtual private networks;virtual applications and operating systems; and virtual clients. In oneexample, management layer 404 may provide the functions described below.Resource provisioning provides dynamic procurement of computingresources and other resources that are utilized to perform tasks withinthe cloud computing environment. Metering and Pricing provide costtracking as resources are utilized within the cloud computingenvironment, and billing or invoicing for consumption of theseresources. In one example, these resources may comprise applicationsoftware licenses. Security provides identity verification for cloudconsumers and tasks, as well as protection for data and other resources.User portal provides access to the cloud computing environment forconsumers and system administrators. Service level management providescloud computing resource allocation and management such that requiredservice levels are met. Service Level Agreement (SLA) planning andfulfillment provide pre-arrangement for, and procurement of, cloudcomputing resources for which a future requirement is anticipated inaccordance with an SLA.

Workloads layer 406 provides examples of functionality for which thecloud computing environment may be utilized. Examples of workloads andfunctions which may be provided from this layer include: mapping andnavigation; software development and lifecycle management; virtualclassroom education delivery; data analytics processing; transactionprocessing; and logical relationship detection.

The present techniques may be a system, a method or computer programproduct. The computer program product may include a computer readablestorage medium (or media) having computer readable program instructionsthereon for causing a processor to carry out aspects of the presentinvention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present techniques may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present techniques.

Aspects of the present techniques are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of thetechniques. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

FIG. 5 is an example computing device can detect logical relationshipsbased on structured query statements. The computing device 500 may befor example, a server, desktop computer, laptop computer, tabletcomputer, or smartphone. In some examples, computing device 500 may be acloud computing node. Computing device 500 may be described in thegeneral context of computer system executable instructions, such asprogram modules, being executed by a computer system. Generally, programmodules may include routines, programs, objects, components, logic, datastructures, and so on that perform particular tasks or implementparticular abstract data types. Computing device 500 may be practiced indistributed cloud computing environments where tasks are performed byremote processing devices that are linked through a communicationsnetwork. In a distributed cloud computing environment, program modulesmay be located in both local and remote computer system storage mediaincluding memory storage devices.

The computing device 500 may include a processor 502 that is to executestored instructions, a memory device 504 to provide temporary memoryspace for operations of said instructions during operation. Theprocessor can be a single-core processor, multi-core processor,computing cluster, or any number of other configurations. The memory 504can include random access memory (RAM), read only memory, flash memory,or any other suitable memory systems.

The processor 502 may be connected through a system interconnect 506(e.g., PCI®, PCI-Express®, etc.) to an input/output (I/O) deviceinterface 508 adapted to connect the computing device 500 to one or moreI/O devices 510. The I/O devices 510 may include, for example, akeyboard and a pointing device, wherein the pointing device may includea touchpad or a touchscreen, among others. The I/O devices 510 may bebuilt-in components of the computing device 500, or may be devices thatare externally connected to the computing device 500.

The processor 502 may also be linked through the system interconnect 506to a display interface 512 adapted to connect the computing device 500to a display device 514. The display device 514 may include a displayscreen that is a built-in component of the computing device 500. Thedisplay device 514 may also include a computer monitor, television, orprojector, among others, that is externally connected to the computingdevice 500. In addition, a network interface controller (NIC) 516 may beadapted to connect the computing device 500 through the systeminterconnect 506 to the network 518. In some embodiments, the NIC 516can transmit data using any suitable interface or protocol, such as theinternet small computer system interface, among others. The network 518may be a cellular network, a radio network, a wide area network (WAN), alocal area network (LAN), or the Internet, among others. An externalcomputing device 520 may connect to the computing device 500 through thenetwork 518. In some examples, external computing device 520 may be anexternal webserver 520. In some examples, external computing device 520may be a cloud computing node.

The processor 502 may also be linked through the system interconnect 506to a storage device 522 that can include a hard drive, an optical drive,a USB flash drive, an array of drives, or any combinations thereof. Insome examples, the storage device may include an extractor module 524, adetector module 526, a displayer module 528, and a modifier module 530.The extractor module 524 can receive a plurality of structured querystatements associated with an application and a database. For example,the structured query statements comprise intercepted SQL statementsagainst a relational database. In some examples, the extractor module524 can extract structured query statements from a source code of theapplication. In some examples, the extractor module 524 can capturestructured query statements from a bespoke database driver. For example,the bespoke database driver can be an application programming interface(API) for accessing databases such as Open Database Connectivity (ODBC),Java Database Connectivity (JDBC), or a proprietary driver. In someexamples, the extractor module 524 can detect structured querystatements in real time. The detector module 526 can detect a logicalrelationship between at least two of the plurality of structured querystatements based on a common source, a predetermined threshold time, acommon transaction, or any combination thereof. For example, a commonsource can be detected based on a common Internet Protocol (IP) address.A predetermined threshold time can be a maximum time between detectedstructured query statements. A common transaction can be associated withtwo or more of the structured query statements. The detector module 526can generate a model based on the detected logical relationship. In someexamples, the model can include a data flow graph. The displayer module528 can receive a request to modify the database. The displayer module528 can display a warning in response to receiving the request to modifythe database based on the detected logical relationship. In someexamples, the displayer module 528 can generate a report based on thedetected logical relationship comprising a trust level indicated bycolor. The modifier module 530 can also modify the database in responseto detecting that a predetermined threshold probability of applicationfunctionality impairment is not exceeded. For example, the processor canmodify the schema of the database, or remove and/or split tables in thedatabase. For example, the modification may affect an applicationfunction with a low probability or not affect any functionality of theapplication. In some examples, if the modification has a probability ofimpairing a functionality of the application with a probability thatexceeds the predetermined threshold probability, then the modificationmay be prevented. In some examples, a warning can be issued in responseto detecting that the probability of impairing one or morefunctionalities of the application exceeds the predetermined thresholdprobability.

It is to be understood that the block diagram of FIG. 5 is not intendedto indicate that the computing device 500 is to include all of thecomponents shown in FIG. 5. Rather, the computing device 500 can includefewer or additional components not illustrated in FIG. 5 (e.g.,additional memory components, embedded controllers, modules, additionalnetwork interfaces, etc.). Furthermore, any of the functionalities ofthe extractor module 524, the detector module 526, the displayer module528, and the modifier module 530, may be partially, or entirely,implemented in hardware and/or in the processor 502. For example, thefunctionality may be implemented with an application specific integratedcircuit, logic implemented in an embedded controller, or in logicimplemented in the processor 502, among others. In some embodiments, thefunctionalities of the extractor module 524, detector module 526,displayer module 528, and modifier module 530, can be implemented withlogic, wherein the logic, as referred to herein, can include anysuitable hardware (e.g., a processor, among others), software (e.g., anapplication, among others), firmware, or any suitable combination ofhardware, software, and firmware.

Referring now to FIG. 6, a block diagram is depicted of an exampletangible, non-transitory computer-readable medium 600 that can detectlogical relationships based on structured query statements. Thetangible, non-transitory, computer-readable medium 600 may be accessedby a processor 602 over a computer interconnect 604. Furthermore, thetangible, non-transitory, computer-readable medium 600 may include codeto direct the processor 602 to perform the operations of the method 200of FIG. 2 above.

The various software components discussed herein may be stored on thetangible, non-transitory, computer-readable medium 600, as indicated inFIG. 6. For example, an extractor module 606 includes code to receive aplurality of structured query statements associated with an applicationand a database. The extractor module 606 can also include code toextract the plurality of structured query statements from the sourcecode of the application. The extractor module 606 can also furtherinclude code to extract the plurality of structured query statementsfrom pre-bound packages stored within a database comprising a metadatarepository. The extractor module 606 can also include code to capturethe plurality of structured query statements from a bespoke databasedriver. A detector module 608 includes code to detect a logicalrelationship between at least two of the plurality of structured querystatements based on a common source of the at least two structured querystatements, a predetermined threshold time between the at least twostructured query statements, a common transaction associated with the atleast two structured query statements, or any combination thereof. Insome examples, the detector module 608 can include code to detect abatch of statements in the plurality of structured query statements. Forexample, a batch of statements can be detected based on a predeterminedthreshold time, a common source, and/or same transaction. In someexamples, the detector module 608 can include code to generate a modelbased on the detected logical relationship. For example, the model caninclude a data flow graph. In some examples, the model can be expressedas a Database definition language (DDL) model, an InfoSphere® DataArchitect logical data model, an ERWin® data model, an XML model, a JSONmodel, or any other suitable data format. A displayer module 610includes code to receive a request to modify the database and generate areport based on the model. The displayer module 610 can also includecode to display a warning in response to receiving the request to modifythe database based on the detected logical relationship. A modifiermodule 612 can modify the database in response to detecting that apredetermined threshold probability of application functionalityimpairment is not exceeded. For example, the modifier module 612 canmodify the schema of the database, or remove and/or split tables in thedatabase. In some examples, the detector module 608 can calculate theprobability based on the model. In some examples, if the predeterminedthreshold probability is exceed, then the modifier module 612 canprevent the modification of the database. For example, the modifiermodule 612 can cause the displayer module 610 to display the warninginstead. It is to be understood that any number of additional softwarecomponents not shown in FIG. 6 may be included within the tangible,non-transitory, computer-readable medium 600, depending on theparticular application.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present techniques. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions. It is to be understood that any number ofadditional software components not shown in FIG. 6 may be includedwithin the tangible, non-transitory, computer-readable medium 600,depending on the specific application.

The descriptions of the various embodiments of the present techniqueshave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

What is claimed is:
 1. A system, comprising: a processor, wherein thesystem is capable of performing a method comprising: receiving aplurality of structured query statements associated with an applicationand a database; detecting a logical relationship between at least two ofthe plurality of structured query statements based on a common source, apredetermined threshold time, and a common transaction; generating amodel based on the detected logical relationship; receiving a request tomodify the database; and modifying the database in response to detectingthat a predetermined threshold probability of application functionalityimpairment is not exceeded.
 2. The system of claim 1, furthercomprising: displaying a warning in response to receiving a structuralchange to the database based on the detected logical relationship. 3.The system of claim 1, further comprising: generating a report based onthe detected logical relationship comprising a trust level indicated byat least one color.
 4. The system of claim 1, wherein the plurality ofstructured query statements comprise a plurality of intercepted SQLstatements against a relational database.
 5. The system of claim 1,wherein the plurality of structured query statements are extracted froma source code of the application.
 6. The system of claim 1, wherein theplurality of structured query statements are captured from a bespokedatabase driver.
 7. The system of claim 1, wherein the plurality ofstructured query statements are detected in real time.
 8. Acomputer-implemented method, comprising: receiving a plurality ofstructured query statements associated with an application and adatabase; detecting a logical relationship between at least two of theplurality of structured query statements based on a common source, apredetermined threshold time, and a common transaction; generating amodel based on the detected logical relationship; receiving a request tomodify the database; and modifying the database in response to detectingthat a predetermined threshold probability of application functionalityimpairment is not exceeded.
 9. The computer-implemented method of claim8, further comprising: calculating a probability of applicationfunctionality impairment associated with the request to modify thedatabase based on the logical relationship, wherein the request tomodify the database is to modify the logical relationship.
 10. Thecomputer-implemented method of claim 8, further comprising: receiving aplurality of responses to the plurality of structured query statements,wherein the detected logical relationship is further based on at leastone of the plurality of responses.
 11. The computer-implemented methodof claim 8, further comprising: generating a report comprising a trustlevel based on the detected logical relationship.
 12. Thecomputer-implemented method of claim 8, further comprising: receiving asource code of the application and extracting the plurality ofstructured query statements from the source code of the application. 13.The computer-implemented method of claim 8, further comprising:extracting the plurality of structured query statements from pre-boundpackages stored within a database metadata repository.
 14. Thecomputer-implemented method of claim 8, further comprising: capturingthe plurality of structured query statements from a bespoke databasedriver.
 15. A computer program product for detecting logicalrelationships between structured query statements, the computer programproduct comprising a computer-readable storage medium having programcode embodied therewith, wherein the computer readable storage medium isnot a transitory signal per se, the program code executable by aprocessor to cause the processor to: receive a plurality of structuredquery statements associated with an application and a database; detect alogical relationship between at least two of the plurality of structuredquery statements based on a common source of the at least two of theplurality of structured query statements, a predetermined threshold timebetween the at least two of the plurality of structured querystatements, and a common transaction associated with the at least two ofthe plurality of structured query statements; generate a model based onthe detected logical relationship; receive a request to modify thedatabase; and modify the database in response to detecting that apredetermined threshold probability of application functionalityimpairment is not exceeded.
 16. The computer program product of claim15, further comprising program code executable by the processor to:display a warning in response to receiving the request to modify thedatabase based on the detected logical relationship.
 17. The computerprogram product of claim 15, further comprising program code executableby the processor to: extract the plurality of structured querystatements from the source code of the application.
 18. The computerprogram product of claim 15, further comprising program code executableby the processor to: extract the plurality of structured querystatements from pre-bound packages stored on a database comprising ametadata repository.
 19. The computer program product of claim 15,further comprising program code executable by the processor to: capturethe plurality of structured query statements from a bespoke databasedriver.
 20. The computer program product of claim 15, further comprisingprogram code executable by the processor to: detect a batch ofstatements in the plurality of structured query statements.